Engineering Time-Expanded Graphs for Faster Timetable Information
نویسندگان
چکیده
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed-up techniques whose adaption to timetable networks is more challenging than one might expect.
منابع مشابه
Contracting Timetable Information Networks
During the last years, impressive progress has been achieved in the field of speed-up techniques for DIJKSTRA’s algorithm. Due to the availability of road networks, most speed-up techniques were developed for such networks. The fastest known techniques use contraction, a procedure that reduces the graph size, in order to gain their impressive speed-ups. However, in a recent work it was observed...
متن کاملTimetable Information Updating in Case of Delays : Modeling
The timetable information problem can be solved by computing shortest paths in special graphs built from timetable data. In general, two models exist: the time-dependent and time-expanded network. In a recent work, both models are compared with respect to advantages and disadvantages on a theoretical and a practical framework. In addition, an extensive experimental evaluation reveals further di...
متن کاملMaintenance of Multi-level Overlay Graphs for Timetable Queries
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s algorithm. Due to the continuously growing size of real-world graphs, there is a constant need for faster algorithms and many techniques have been devised to heuristically speed up Dijkstra’s algorithm. One of these tech...
متن کاملExperimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the time-dependent approach the graph contains only one node per station. Both approaches have been recently considered for the...
متن کاملEdges as Nodes - a New Approach to Timetable Information
In this paper we suggest a new approach to timetable information by introducing the “edge-converted graph” of a timetable. Using this model we present simple algorithms that solve the earliest arrival problem (EAP) and the minimum number of transfers problem (MNTP). For constant-degree graphs this yields linear-time algorithms for EAP and MNTP which improves upon the known Dijkstra-based approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008